Power counting energy flow polynomials

نویسندگان

چکیده

Power counting is a systematic strategy for organizing collider observables and their associated theoretical calculations. In this paper, we use power to characterize class of jet substructure called energy flow polynomials (EFPs). EFPs provide an overcomplete linear basis infrared-and-collinear safe observables, but it known that in practice, small subset often sufficient specific analysis tasks. By applying arguments, obtain relationships between hold quark gluon jets order the counting. We test these relations parton shower generator Pythia, finding excellent agreement. allows us truncate without affecting performance, which corroborate through study quark-gluon tagging regression.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Counting Polynomials of Some Nanostructures

The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is another molecular descriptor. In this paper we compute these three polynomials for some infinite classes of nanostructures.

متن کامل

Counting Roots of Polynomials Over Prime Power Rings

Suppose $p$ is a prime, $t$ is a positive integer, and $f\!\in\!\mathbb{Z}[x]$ is a univariate polynomial of degree $d$ with coefficients of absolute value $<\!p^t$. We show that for any fixed $t$, we can compute the number of roots in $\mathbb{Z}/(p^t)$ of $f$ in deterministic time $(d+\log p)^{O(1)}$. This fixed parameter tractability appears to be new for $t\!\geq\!3$. A consequence for arit...

متن کامل

on counting polynomials of some nanostructures

the omega polynomial(x) was recently proposed by diudea, based on the length of stripsin given graph g. the sadhana polynomial has been defined to evaluate the sadhana index ofa molecular graph. the pi polynomial is another molecular descriptor. in this paper wecompute these three polynomials for some infinite classes of nanostructures.

متن کامل

Counting perfect polynomials

Let A ∈ F2[T ]. We say A is perfect if A coincides with the sum of all of its divisors in F2[T ]. We prove that the number of perfect polynomials A with |A| ≤ x is O (x1/12+ ) for all > 0, where |A| = 2degA. We also prove that every perfect polynomial A with 1 < |A| ≤ 1.6× 1060 is divisible by T or T + 1; that is, there are no small “odd” perfect polynomials.

متن کامل

Counting words with Laguerre polynomials

We develop a method for counting words subject to various restrictions by finding a combinatorial interpretation for a product of formal sums of Laguerre polynomials. We use this method to find the generating function for k-ary words avoiding any vincular pattern that has only ones. We also give generating functions for k-ary words cyclically avoiding vincular patterns with only ones whose runs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of High Energy Physics

سال: 2022

ISSN: ['1127-2236', '1126-6708', '1029-8479']

DOI: https://doi.org/10.1007/jhep09(2022)021